The eigenvalue problem for linear and affine iterated function systems
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA Characterization of Hyperbolic Affine Iterated Function Systems
The two main theorems of this paper provide a characterization of hyperbolic affine iterated function systems defined on R. Atsushi Kameyama [Distances on topological self-similar sets, in Fractal Geometry and Applications: A Jubilee of Benǒit Mandelbrot. Proceedings of Symposia in Pure Mathematics, Volume 72, Part 1, 2004, pages 117–129] asked the following fundamental question: Given a topolo...
متن کاملRotation number and its properties for iterated function and non-autonomous systems
The main purpose of this paper is to introduce the rotation number for non-autonomous and iterated function systems. First, we define iterated function systems and the lift of these types of systems on the unit circle. In the following, we define the rotation number and investigate the conditions of existence and uniqueness of this number for our systems. Then, the notions rotational entropy an...
متن کاملOn the Relation between Iterated Function Systems and Partitioned Iterated Function Systems on the Relation between Iterated Function Systems and Partitioned Iterated Function Systems on the Relation between Iterated Function Systems and Partitioned Iterated Function Systems
In this paper, we give a theoretically founded transition from Iterated Function Systems based on aane transformations to Partitioned Iterated Function Systems. We show that there are two essential steps, namely, restricting the aane transformations, and solving the evoked problem of ink dissipation. In this paper, we give a theoretically founded transition from Iterated Function Systems based ...
متن کاملA linear eigenvalue algorithm for the nonlinear eigenvalue problem
The Arnoldi method for standard eigenvalue problems possesses several attractive properties making it robust, reliable and efficient for many problems. Our first important result is a characterization of a general nonlinear eigenvalue problem (NEP) as a standard but infinite dimensional eigenvalue problem involving an integration operator denoted B. In this paper we present a new algorithm equi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2011
ISSN: 0024-3795
DOI: 10.1016/j.laa.2011.05.011